Monotone conjunctive structures of second order
نویسندگان
چکیده
We introduce a class of conjunctive structures of second order for which the consistent labeling problem is solvable in polynomial time. This result is generalized then to a class of “maxmin” problems.
منابع مشابه
Expressiveness of the modal mu-calculus on monotone neighborhood structures
We characterize the expressive power of the modal μ-calculus on monotone neighborhood structures, in the style of the Janin-Walukiewicz theorem for the standard modal μ-calculus. For this purpose we consider a monadic second-order logic for monotone neighborhood structures. Our main result shows that the monotone modal μ-calculus corresponds exactly to the fragment of this second-order language...
متن کاملMonotone 3-Sat-4 is NP-complete
Monotone 3-Sat-4 is a variant of the satisfiability problem for boolean formulae in conjunctive normal form. In this variant, each clause contains exactly three literals—either all or none of them are positive, i. e., no clause contains both a positive and a negative literal—and every variable appears at most four times in the formula. Moreover, every clause consists of three distinct literals....
متن کاملBerge Multiplication for Monotone Boolean Dualization
Given the prime CNF representation φ of a monotone Boolean function f : {0, 1} 7→ {0, 1}, the dualization problem calls for finding the corresponding prime DNF representation ψ of f . A very simple method (called Berge multiplication [3, Page 52–53]) works by multiplying out the clauses of φ from left to right in some order, simplifying whenever possible using the absorption law. We show that f...
متن کاملOn Berge Multiplication for Monotone Boolean Dualization
Given the prime CNF representation φ of a monotone Boolean function f : {0, 1} 7→ {0, 1}, the dualization problem calls for finding the corresponding prime DNF representation ψ of f . A very simple method (called Berge multiplication [3, Page 52–53]) works by multiplying out the clauses of φ from left to right in some order, simplifying whenever possible using the absorption law. We show that f...
متن کاملExponential Lower Bounds and Separation for Query Rewriting
We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of firstorder and nonrecursive Datalog rewritings for conjunctive queries over OWL2QL ontologies. We use known lower bounds and separation results from circuit complexity to prove similar results for the size of rewritings that do not use non-signature constants. For example, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998